Achievable Rate Region of the Bidirectional Buffer-Aided Relay Channel With Block Fading
نویسندگان
چکیده
منابع مشابه
Bounds on the Achievable Rate for the Fading Relay Channel with Finite Input Constellations
We consider the wireless Rayleigh fading relay channel with finite complex input constellations. Assuming global knowledge of the channel state information and perfect synchronization, upper and lower bounds on the achievable rate, for the full-duplex relay, as well as the more practical halfduplex relay (in which the relay cannot transmit and receive simultaneously), are studied. Assuming the ...
متن کاملPower Allocation Strategies in Block-Fading Two-Way Relay Networks
This paper aims at investigating the superiority of power allocation strategies, based on calculus of variations in a point-to-point two-way relay-assisted channel incorporating the amplify and forward strategy. Single and multilayer coding strategies for two cases of having and not having the channel state information (CSI) at the transmitters are studied, respectively. Using the notion of cal...
متن کاملAn Achievable Rate Region for Relay Multiple Access Channel Based on Decode-and-Forward
In this paper, we model a specific relay channel named relay multiple access channel (RMAC) aiming at providing a clue to select the relay node in multiple access channels such as the uplink of cellular communication system. In this channel, the relay node not only aids to send the information of the source but also sends its private message to the destination. We derive the achievable rate reg...
متن کاملEvaluation of an achievable rate region for the broadcast channel
Ahwc-The problem of transmission of separate messages to each of two receivers over a general binary-input broadcast channel is investigated. A new approach to a class of information-t problems is developed and applied to obtain boonds on the cardinalitiea of aoxiliary random variables. These bounds permit the calculation of two different regions of achievable rate pairs which are derived from ...
متن کاملTiming Channel: Achievable Rate in the Finite Block-Length Regime
• Symbols denoting random variables are capitalized but symbols denoting their realization are not. • Bold face is used for vectors. • Blackboard bold or non-italic face are used for sets, calligraphic face for system of sets. • We use x̄ as a shorthand for the difference 1 − x for x ∈ [0, 1]. • Z is the set of all integers and Z+ = {z ∈ Z : z ≥ 0}. • 2 is the set {0, 1}. • [n] denotes the set {...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2356649